1794B - Not Dividing - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int inf = 9e18;
int mod = 1e9 + 7;
int gcd(int a, int b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
vector<int> sieve(int n) {int*arr = new int[n + 1](); vector<int> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}
#define debug(args...) { string _debug_list = #args; replace(_debug_list.begin(), _debug_list.end(), ',', ' '); stringstream _debug_stream(_debug_list); istream_iterator<string> __it(_debug_stream); debug_func(__it, args); }
void debug_func(istream_iterator<string> _it) {
    cerr << endl;
}

void solve()
{
    int n;
    cin >> n;
    int a[n];
    for(int i=0;i<n;i++)
    {
       cin >> a[i];
    }
    for(int i=0;i<n;i++)
    {
        if(a[i]==1)
        a[i]++;
    }
    for(int i=1;i<n;i++)
    {
        if(a[i]%a[i-1]==0)
        a[i]++;
    }
    for(int i=0;i<n;i++)
    cout << a[i] <<  " ";
    cout << endl;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1;
    cin >> t;
    while(t--)
{
    solve();
}
    return 0;
}